Contragredient equivalence: A canonical form and some applications

Some remarks on the Brunovsky canonical form

Among the various canonical forms which were proposed for constant linear systems, the one due to Brunovsky [1] certainly is the most profound. It characterizes a dynamics modulo the group of static state feedbacks by a finite set of pure integrators. Its proof, which is quite computational, has been improved in various ways, and can be found in several textbooks (see, e.g., [12, 13, 20, 21] an...

A canonical form for some piecewise defined functions

We define a canonical form for piecewise defined functions. We show that this has a wider range of application as well as better complexity properties than previous work.

On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are de ned using the discontinuities of correspondences of standard equilibrium concepts like correlated Nash and robust equilibrium or risk dominance and rationalizability Resulting equivalence classes are fully character ized and compared across di erent equilibrium concepts for games larger games are also considered It is argued that the proce dure le...

On Equivalence and Canonical Forms

Decidability of de nitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of de nitional equality are based on a con uent, strongly-normalizing notion of reduction. Coquand has considered a di erent approach, directly proving the correctness of a practical equivalance algorithm based on the shape o...

A Rational Canonical Form Algorithm